package com.hardy.leecode;

import com.hardy.leecode.model.Node;

import java.util.concurrent.locks.AbstractQueuedSynchronizer;

/**
 * Author: Hardy
 * Date:   2020/6/27
 * Description:
 **/
public class Temp extends AbstractQueuedSynchronizer {

    public static void main(String[] args) {
//        System.out.println(new Solution().test(new int[10]));
    }

    static class Solution {

//        public int test(Node node) {
//            int v = node.val;
//            Node cur = node;
//
//
//            // 3 1 2 3 1 7
//            while (node != null) {
//               if (node.val <= v) node = node.next;
//
//
//            }
//        }
    }

}
